Neighbors-Based Graph Construction for Dimensionality Reduction
نویسندگان
چکیده
منابع مشابه
Dimensionality Reduction with Unsupervised Nearest Neighbors
The growing information infrastructure in a variety of disciplines involves an increasing requirement for efficient data mining techniques. Fast dimensionality reduction methods are important for understanding and processing of large data sets of high-dimensional patterns. In this work, unsupervised nearest neighbors (UNN), an efficient iterative method for dimensionality reduction, is presente...
متن کاملNonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-dimensional data. Research however has shown that computing nearest neighbors of a point from a highdimensional data set generally requires time proportional to the size of the data set itself, rendering the computation...
متن کاملFast Training of Graph-Based Algorithms for Nonlinear Dimensionality Reduction
Introduction Dimensionality reduction algorithms have long been used either for exploratory analysis of a high-dimensional dataset, to reveal structure such as clustering, or as a preprocessing step, by extracting low-dimensional features that are useful for classification or other tasks. Here we focus on dimensionality reduction algorithms where a dataset consisting of N objects is represented...
متن کاملA novel supervised dimensionality reduction algorithm: Graph-based Fisher analysis
In this paper, a novel supervised dimensionality reduction (DR) algorithm called graphbased Fisher analysis (GbFA) is proposed. More specifically, we redefine the intrinsic and penalty graph and trade off the importance degrees of the same-class points to the intrinsic graph and the importance degrees of the not-same-class points to the penalty graph by a strictly monotone decreasing function; ...
متن کاملMatrix Decomposition-based Dimensionality Reduction on Graph Data
Graph is a mathematical framework that allows us to represent and manage many real-world data such as relational data, multimedia data and biomedical data. When each data point is represented as a graph and we are given a number of graphs, a task is to extract a few common patterns that capture the property of each population. A frequent graph mining algorithm such as AGM, gSpan and Gaston can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2939539